Solving mixed integer nonlinear programs by outer approximation
نویسندگان
چکیده
A wide range of optimization problems arising from engineering applications can be formulated as Mixed Integer NonLinear Programmming problems (MINLPs). Duran and Grossmann (1986) suggest an outer approximation scheme for solving a class of MINLPs that are linear in the integer variables by a nite sequence of relaxed MILP master programs and NLP subproblems. Their idea is generalized by treating nonlinearities in the integer variables directly , which allows a much wider class of problem to be tackled, including the case of pure INLPs. A new and more simple proof of nite termination is given and a rigorous treatment of infeasible NLP subproblems is presented which includes all the common methods for resolving infeasibility in Phase I. The worst case performance of the outer approximation algorithm is investigated and an example is given for which it visits all integer assignments. This behaviour leads us to include curvature information into the relaxed MILP master problem, giving rise to a new quadratic outer approximation algorithm. An alternative approach is considered to the diiculties caused by infeasibility in outer approximation, in which exact penalty functions are used to solve the NLP subproblems. It is possible to develop the theory in an elegant way for a large class of nonsmooth MINLPs based on the use of convex composite functions and subdiierentials, although an interpretation for the l 1 norm is also given.
منابع مشابه
A Feasibility Pump for mixed integer nonlinear programs
Abstract We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We r...
متن کاملA Computational Comparison of Branch and Bound and Outer Approximation Algorithms for Mixed Integer Nonlinear Programs
In this paper we compare the performance of two codes for convex mixed integer nonlinear programs on a number of test problems The rst code uses a branch and bound algorithm The second code is a commer cially available implementation of an outer approximation algorithm The comparison demonstrates that both approaches are generally capable of solving the test problems However there are signi can...
متن کاملA computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
In this paper we compare the performance of two codes for convex 0-1 mixed integer nonlinear programs on a number of test problems. The rst code uses a branch and bound algorithm. The second code is a commercially available implementation of an outer approximation algorithm. The comparison demonstrates that both approaches are generally capable of solving the test problems. However, there are s...
متن کاملAn algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exp...
متن کاملSCIP: Global Optimization of Mixed-Integer Nonlinear Programs in a Branch-and-Cut Framework
This paper describes the extensions that were added to the constraint integer programmingframework SCIP in order to enable it to solve convex and nonconvex mixed-integer nonlinearprograms (MINLPs) to global optimality. SCIP implements a spatial branch-and-bound algorithmbased on a linear outer-approximation, which is computed by convex overand underestimationof nonconvex functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 66 شماره
صفحات -
تاریخ انتشار 1994